ROUGH SETS REDUCTION FOR BINARY DATA

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Approach for Knowledge Based Systems Reduction using Rough Sets Theory (RESEARCH NOTE)

Problem of knowledge analysis for decision support system is the most difficult task of information systems. This paper presents a new approach based on notions of mathematical theory of Rough Sets to solve this problem. Using these concepts a systematic approach has been developed to reduce the size of decision database and extract reduced rules set from vague and uncertain data. The method ha...

متن کامل

Rough and Fuzzy Sets for Dimensionality Reduction

One of the main obstacles facing current machine learning techniques is that of dataset dimensionality. Usually, a redundancy-removing step is carried out beforehand to enable these techniques to be effective. Rough Set Theory (RST) has been used as such a dataset pre-processor with much success, however it is reliant upon a discretized dataset; important information may be lost as a result of ...

متن کامل

Fuzzy-Rough Sets for Descriptive Dimensionality Reduction

One of the main obstacles facing current fuzzy modelling techniques is that of dataset dimensionality. To enable these techniques to be effective, a redundancy-removing step is usually carried out beforehand. Rough Set Theory (RST) has been used as such a dataset pre-processor with much success, however it is reliant upon a crisp dataset; important information may be lost as a result of quantiz...

متن کامل

L-valued Fuzzy Rough Sets

In this paper, we take a GL-quantale as the truth value table to study a new rough set model—L-valued fuzzy rough sets. The three key components of this model are: an L-fuzzy set A as the universal set, an L-valued relation of A and an L-fuzzy set of A (a fuzzy subset of fuzzy sets). Then L-valued fuzzy rough sets are completely characterized via both constructive and axiomatic approaches. 

متن کامل

Rough Entropy Based on Generalized Rough Sets Covering Reduction

In generalized rough set covering reduction theory, it is necessary to find a new measure to knowledge and rough set because the upper and lower approximations of rough sets are determined by their covering reduction. In this paper, information entropy is introduced to discuss the rough entropy of knowledge and the roughness of rough set, based on generalized rough set covering reduction. A new...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ERJ. Engineering Research Journal

سال: 2008

ISSN: 1110-1180

DOI: 10.21608/erjm.2008.69536